How to construct the symmetric cycle of length 5 using Haj\'os construction with an adapted Rank Genetic Algorithm

In 2020 Bang-Jensen et. al. generalized the Haj\'os join of two graphs to class digraphs and several results for vertex colorings in digraphs. Although, as a consequence these results, digraph can be obtained by constructions (directed identifying non-adjacent vertices), determining obtain is complex problem. particular, et posed problem operations construct symmetric 5-cycle from complete order 3 using only constructions. We successfully adapted rank-based genetic algorithm solve this introduction innovative recombination mutation operators graph theory. The Join became operator identification independent vertices operator. way, we were able sequence 16 cycle 5.